منابع مشابه
Balance in Stochastic Signed Graphs
Signed graphs provide models for investigating balance in connection with various kinds of social relations. Since empirical social networks always involve uncertainty because of errors due to measurement, imperfect observation or sampling, it is desirable to incorporate uncertainty into signed graph models. We introduce a stochastic signed graph and investigate the properties of some indices o...
متن کاملBalance in Random Signed Graphs
By extending Heider’s and Cartwright-Harary’s theory of balance in deterministic social structures, we study the problem of balance in social structures where relations between individuals are random. An appropriate model for representing such structures is the so called random signed graphs Gn,p,q defined as follows. Given a set of n vertices and fixed numbers p and q, 0 < p+ q < 1, then, betw...
متن کاملWeak Balance in Random Signed Graphs
In this work we deal with questions on balance and weak balance in random graphs. The theory of balance goes back to Heider [12] who asserted that a social system is balanced if there is no tension and that unbalanced social structures exhibit a tension resulting in a tendency to change in the direction of balance. Since this first work of Heider, the notion of balance has been extensively stud...
متن کاملdirectionally n-signed graphs-iii: the notion of symmetric balance
let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Networks
سال: 1979
ISSN: 0378-8733
DOI: 10.1016/0378-8733(79)90004-2